Prefix-Free Łukasiewicz Languages
نویسنده
چکیده
Generalised Łukasiewicz languages are simply described languages having good information-theoretic properties. An especially desirable property is the one of being a prefix code. This paper addresses the question under which conditions a generalised Łukasiewicz language is a prefix code. Moreover, an upper bound on the delay of decipherability of a generalised Łukasiewicz language is derived.
منابع مشابه
Generalizations of Code Languages with Marginal Errors
We study k-prefix-free, k-suffix-free and k-infix-free languages that generalize prefix-free, suffix-free and infix-free languages by allowing marginal errors. For example, a string x in a k-prefix-free language L can be a prefix of up to k different strings in L. Namely, a code (language) can allow some marginal errors. We also define finitely prefix-free languages in which a string x can be a...
متن کاملCS – 2008 – 06 Continuous Languages
A language is prefix-continuous if it satisfies the condition that, if a word w and its prefix u are in the language, then so is every prefix of w that has u as a prefix. Prefix-continuous languages include prefix-closed languages at one end of the spectrum, and prefix-free languages, which include prefix codes, at the other. In a similar way, we define suffix-, bifix-, factor-, and subword-con...
متن کاملState Complexity of Prefix-Free Regular Languages
We investigate the state complexities of basic operations for prefix-free regular languages. The state complexity of an operation for regular languages is the number of states that are necessary and sufficient in the worst-case for the minimal deterministic finite-state automaton (DFA) that accepts the language obtained from the operation. We know that a regular language is prefix-free if and o...
متن کاملRelative Prefix Distance Between Languages
The prefix distance between two words x and y is defined as the number of symbols in x and y that do not belong to their longest common prefix. The relative prefix distance from a language L1 to a language L2, if finite, is the smallest integer k such that for every word in L1, there is a word in L2 with prefix distance at most k. We study the prefix distance between regular, visibly pushdown, ...
متن کاملSyntactic Complexity of Prefix-, Suffix-, and Bifix-Free Regular Languages
The syntactic complexity of a regular language is the cardinality of its syntactic semigroup. The syntactic complexity of a subclass of the class of regular languages is the maximal syntactic complexity of languages in that class, taken as a function of the state complexity n of these languages. We study the syntactic complexity of prefix-, suffix-, and bifix-free regular languages. We prove th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007